Compiling Qualitative Preferences into Decision-Theoretic Golog Programs
نویسندگان
چکیده
Personalization is becoming increasingly important in agent programming, particularly as it relates to the Web. We propose to develop underspecified, task-specific agent programs, and to automatically personalize them to the preferences of individual users. To this end, we propose a framework for agent programming that integrates rich, non-Markovian, qualitative user preferences with quantitative Markovian reward functions. We begin with DT-Golog, a first-order, decision-theoretic agent programming language in the situation calculus. We present an algorithm that compiles qualitative preferences into Golog programs and prove it sound and complete with respect to the space of solutions. To integrate these preferences into DTGolog we introduce the notion of multi-program synchronization and restate the semantics of the language as a transition semantics. We demonstrate the utility of this framework with an application to personalized travel planning over the Web. To the best of our knowledge this is the first work to combine qualitative and quantiative preferences for temporal reasoning. Further, while the focus of this paper is on the integration of qualitative and quantative preferences, a side effect of this work is realization of the simpler task of integrating qualitative preferences alone into agent programming.
منابع مشابه
Decision-Theoretic GOLOG with Qualitative Preferences
Personalization is becoming increasingly important in agent programming, particularly as it relates to the Web. We propose to develop underspecified, task-specific agent programs, and to automatically personalize them to the preferences of individual users. To this end, we propose a framework for agent programming that integrates rich, nonMarkovian, qualitative user preferences expressed in a l...
متن کاملAn On-line Decision-Theoretic Golog Interpreter
We consider an on-line decision-theoretic interpreter and incremental execution of Golog programs. This new interpreter is intended to overcome some limitations of the off-line interpreter proposed in [Boutilier et al., 2000]. We introduce two new search control operators that can be mentioned in Golog programs: the on-line interpreter takes advantage of one of them to save computational effort...
متن کاملOn-line Decision-Theoretic Golog Interpreter
We consider an on-line decision-theoretic interpreter and incremental execution of Golog programs. We introduce two new search control operators and demonstrate in an example how one of them can be used to save computational efforts. In addition to sensing actions designed to identify outcomes of stochastic actions, we consider a new representation for sensing actions that may return both binar...
متن کاملWeb Service Composition via the Customization of Golog Programs with User Preferences
We claim that user preferences are a key component of effective Web service composition, and one that has largely been ignored. In this paper we propose a means of specifying and intergrating user preferences into Web service composition. To this end, we propose a means of performing automated Web service composition by exploiting a flexible template of the composition in the form of a generic ...
متن کاملPlan Recognition by Program Execution in Continuous Temporal Domains
Much of the existing work on plan recognition assumes that actions of other agents can be observed directly. In continuous temporal domains such as traffic scenarios this assumption is typically not warranted. Instead, one is only able to observe facts about the world such as vehicle positions at different points in time, from which the agents’ plans need to be inferred. In this paper we show h...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005